Cis4930 Final Report: Survey of Technology Mapping Algorithms for Lut-based Fgpa

نویسنده

  • Hitoshi Oi
چکیده

Technology mapping is the one of tasks performed by CAD systems to implement a logic circuit by FPGA's. It transforms a pre-optimized boolean network into a network of building blocks of the target FPGA by taking the physical restriction (e. g. number of inputs) into consideration. This report summarizes the chapter 3 of [1] which is a comprehensive and exhaustive reference of technology mapping algorithm written by the developers of chortle-crf, and also introduces few more algorithms developed after [1]. As we have learned there are di erent programming technologies, such as multiplexer-based, anti-fuse, however this report concentrates on the technology mapping algorithm for Look-Up Table (LUT)-based FPGA's.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boolean matching for LUT-based logic blocks with applications toarchitecture evaluation and technology mapping

In this paper, we present new Boolean matching methods for lookup table (LUT)-based programmable logic blocks (PLBs) and their applications to PLB architecture evaluations and field programmable gate array (FPGA) technology mapping. Our Boolean matching methods, which are based on functional decomposition operations, can characterize functions for complex PLBs consisting of multiple LUTs (possi...

متن کامل

LUT-based FPGA technology mapping under arbitrary net-delay models

The field programmable gate-array (FPGA) has become an important technology in VLSI ASIC designs. Most existing algorithms for performance-driven technology mapping for Lookup-table (LUT) based FPGA designs are based on the unit-delay model. In this paper we study the technology mapping problem under arbitrary net-delay models. We show that if the net delay can be determined or estimated before...

متن کامل

A Theory on Partially-Dependent Functional Decomposition with Application in LUT-based FPGA

In this paper, we present the theory of partially-dependent functional decomposition. A partially-dependent decomposition of function produces subfunctions which do not depend on all variables in the bound set. Non-disjunctive decomposition is derived as a special case while multiple-output decomposition can be reduced to the partially-dependent functional decomposition in our theory. We develo...

متن کامل

A Power-aware Post-processing under depth constraint for LUT-based FPGA Technology Mapping

It is difficult for LUT-based FPGA technology mapping to generate a power-minimal K-input LUT network with minimum depth at one time because a problem for power-minimization was shown to be NP-hard[5]. A problem for area-minimization is also NP-hard, and area-aware algorithms[7][8][9][10] recover area after generating a depthminimum network. On the other hand, existing poweraware algorithms[11]...

متن کامل

A Parallel Algorithm for the Technology Mapping of LUT-Based FPGAs

Flowmap ((1]) was the rst delay-optimal algorithm for the technology mapping of LUT-based FPGAs. However, even though this algorithm is polynomial, rapid prototyping using FPGAs requires faster solutions. This paper provides an eecient parallelization of flowmap that minimizes locking on shared memory architectures. The innuence of scheduling strategies and technology-speciic parameters on spee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996